Some iterations for factoring a polynomial

نویسنده

G. W. Stewart

چکیده

This paper describes an iterative method for factoring a polynomial that bears the same relation to Bairstow's method as the secant method in a single variable bears to Newton's method. Like the secant method, the generalized secant method requires only one function evaluation for each iteration, and like the secant method it converges to a simple factor with order (1+75)/2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Approach for Design of Lp Polynomial Algorithms

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

متن کامل

Factoring N = pq

We discuss the problem of factoring N = pq and survey some approaches. We then present a specialized factoring algorithm that runs in time Õ(q0.31), which is comparable to the runtime Õ(p) of the factoring algorithm for integers of the form N = pq presented in [1]. We then survey the factoring algorithm of [1] and discuss the number of advice bits needed for it to run in polynomial time. Furthe...

متن کامل

Challenges in Polynomial Factorization∗

Algebraic complexity theory studies the complexity of computing (multivariate) polynomials efficiently using algebraic circuits. This succinct representation leads to fundamental algorithmic challenges such as the polynomial identity testing (PIT) problem (decide non-zeroness of the computed polynomial) and the polynomial factorization problem (compute succinct representations of the factors of...

متن کامل

Factoring Multivariate Polynomials over Algebraic Number Fields

The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...

متن کامل